A correction to Anderssonʼs fusion tree construction

A correction to Andersson's fusion tree construction

Notice: this is the author's version of a work that was accepted for publication in Theoretical Computer Science. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. An unedited ve...

Bias Correction in Classification Tree Construction

Gene Tree Construction and Correction using SuperTree and Reconciliation

The supertree problem asking for a tree displaying a set of consistent input trees has been largely considered for the reconstruction of species trees. Here, we explore this framework for the sake of reconstructing a gene tree from a set of input gene trees on partial data. The phylogenetic tree for the species containing the genes of interest can be used to choose among the many possible compa...

A Randomized Tree Construction Algorithm to Explore Energy Landscapes

We report in the present work a new method for exploring conformational energy landscapes. The method, called T-RRT, combines ideas from statistical physics and robot path planning algorithms. A search tree is constructed on the conformational space starting from a given state. The tree expansion is driven by a double strategy: on the one hand, it is naturally biased towards yet unexplored regi...

A Dynamic Approach to Weighted Suffix Tree Construction Algorithm

In present time weighted suffix tree is consider as a one of the most important existing data structure used for analyzing molecular weighted sequence. Although a static partitioning based parallel algorithm existed for the construction of weighted suffix tree, but for very long weighted DNA sequences it takes significant amount of time. However, in our implementation of dynamic partition based...